About the Confluence of Equational Pattern Rewrite Systems
نویسندگان
چکیده
منابع مشابه
Algorithms and Reductions for Rewriting Problems
In this paper we initiate a study of polynomial-time reductions for some basic decision problems of rewrite systems. We then give a polynomial-time algorithm for the unique-normal-form property of ground systems for the first time. Next we prove undecidability of several problems for a fixed string rewriting system using our reductions. Finally, we prove the decidability of confluence for commu...
متن کاملConfluence of Non-Left-Linear TRSs via Relative Termination
We present a confluence criterion for term rewrite systems by relaxing termination requirements of Knuth and Bendix’ confluence criterion, using joinability of extended critical pairs. Because computation of extended critical pairs requires equational unification, which is undecidable, we give a sufficient condition for testing joinability automatically.
متن کاملA Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
We give a method to prove confluence of term rewriting systems that contain non-terminating rewrite rules such as commutativity and associativity. Usually, confluence of term rewriting systems containing such rules is proved by treating them as equational term rewriting systems and considering E-critical pairs and/or termination modulo E. In contrast, our method is based solely on usual critica...
متن کاملA Reduction-preserving Completion for Proving Confluence of Non-terminating Term Rewriting
We give a method to prove confluence of term rewriting systems that contain non-terminating rewrite rules such as commutativity and associativity. Usually, confluence of term rewriting systems containing such rules is proved by treating them as equational term rewriting systems and considering E-critical pairs and/or termination modulo E. In contrast, our method is based solely on usual critica...
متن کاملHigher-Order Rewrite Systems and Their Confluence
We introduce Higher-Order Rewrite Systems (HRS) which extend term rewriting to-terms. HRS can describe computations on arbitrary terms with bound variables. We show that rewriting is closely related to undirected equational reasoning , and extend three connuence results from term rewriting to HRS: the critical pair lemma by Knuth and Bendix, connuence of rewriting modulo equations a la Huet, an...
متن کامل